Aging-based leakage energy reduction method and system

ABSTRACT

A technique of reducing leakage energy associated with a post-silicon target circuit is generally described herein. One example method includes purposefully aging a plurality of gates in the target circuit based on a targeted metric including a timing constraint associated with the target circuit.

BACKGROUND

Unless otherwise indicated herein, the approaches described in this section are not prior art to the claims in this application and are not admitted to be prior art by inclusion in this section.

Process variation (PV) in IC manufacturing refers to the deviation of IC parameter values from nominal specifications, due to the nature of the manufacturing process generally. The presence of PV in deep submicron technologies has become a major concern for Integrated Circuit (IC) energy optimization attempts. Some existing pre-silicon IC optimization to compensate for the impact of PV apply statistical analysis to capture the PV influence and compensate for the influence in the IC design. These approaches generally are not generic to various designs and technologies, and they can be greatly impacted by random components, such as environment temperatures, which may not be timely reflected in the design models.

Some post-silicon optimization approaches also exist to address the aforementioned issues that the pre-silicon optimization approaches are unable to resolve. However, the existing approaches do not take into consideration any IC aging effect caused by low energy input vectors. In particular, IC aging has long been considered as a detrimental phenomenon to IC design and operation, because it may cause an increase in the threshold voltage, and thus it may result in a delay degradation over time. However, the threshold voltage increase brought by IC aging may cause the leakage energy of a gate to decrease.

Accordingly, methods and systems are described herein to utilize IC aging to reduce leakage energy consumption of a target circuit during the operations of the target circuit.

SUMMARY

In accordance with at least some embodiments of the present disclosure, a method is described for reducing leakage energy associated with a post-silicon target circuit. Some example methods may include purposefully aging a plurality of gates in the target circuit based on a targeted metric including a timing constraint associated with the target circuit.

In accordance with at least some embodiments of the present disclosure, a computer-readable medium containing a sequence of instructions for reducing leakage energy associated with a post-silicon target circuit is also described. Some example instructions, which when executed by a processor, may cause the process to purposefully age a plurality of gates in the target circuit based on a targeted metric including a timing constraint associated with the target circuit.

In accordance with at least some embodiments of the present disclosure, a computing device coupled to a post-silicon target circuit and configured to reduce leakage energy associated with the post-silicon target circuit is described. Some examples computing devices may include a programmable unit and a processor, and the processor may be configured to purposefully age a plurality of gates in the target circuit based on a targeted metric including a timing constraint associated with the target circuit.

The foregoing summary is illustrative only and is not intended to be in any way limiting. In addition to the illustrative aspects, embodiments, and features described above, further aspects, embodiments, and features will become apparent by reference to the drawings and the following detailed description.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing and other features of the present disclosure will become more fully apparent from the following description and appended claims, taken in conjunction with the accompanying drawings. These drawings depict only several embodiments in accordance with the disclosure and are, therefore, not to be considered limiting of its scope. The disclosure will be described with additional specificity and detail through use of the accompanying drawings.

In the drawings:

FIG. 1 shows a block diagram of an example process for performing aging-based leakage energy reduction for a post-silicon target circuit;

FIG. 2 shows an example method for identifying one or more input vectors for post-silicon IC aging;

FIG. 3 is an example satisfiability problem formulation;

FIG. 4 shows examples of critical path and valid sensitization (sensitizable) critical path;

FIG. 5 shows example latency and throughput;

FIG. 6 shows an example gate and the dependency between its inputs and outputs;

FIG. 7 shows another example of how input vectors may be applied to create purposeful gate switching at a particular place and therefore increase the temperature;

FIG. 8 shows an example method 800 for identifying one or more input vectors for post-silicon IC aging in a standby mode; and

FIG. 9 is a block diagram of an example computing device configured to purposefully age a post-silicon target circuit, all arranged in accordance with the some embodiments of the present disclosure.

DETAILED DESCRIPTION

In the following detailed description, reference is made to the accompanying drawings, which form a part hereof. In the drawings, similar symbols typically identify similar components, unless context dictates otherwise. The illustrative embodiments described in the detailed description, drawings, and claims are not meant to be limiting. Other embodiments may be utilized, and other changes may be made, without departing from the spirit or scope of the subject matter presented here. It will be readily understood that the aspects of the present disclosure, as generally described herein, and illustrated in the Figures, can be arranged, substituted, combined, and designed in a wide variety of different configurations, all of which are explicitly contemplated and make part of this disclosure.

This disclosure is generally drawn, inter alia, to devices, systems, methods, and computer programs related to aging-based leakage energy reduction schemes as will be described herein.

Embodiments of the systems and methods described herein involve purposefully aging gates in a post-silicon target circuit based on, or as dictated by, a targeted metric. The targeted metric may involve, without limitation, leakage energy reduction requirements and timing constraints associated with the target circuit. In addition, the term “standby mode” generally refers to a low power mode for a target circuit throughout the present disclosure.

Various models have been developed in the present disclosure, and they are detailed in the following paragraphs.

Energy Model

In some embodiments, leakage energy, switching energy, and delay may be used as manifestational properties of an IC. These properties can be connected with physical properties such as effective channel length and threshold voltage. A gate-level leakage energy model may be based on the following parameters: effective channel length (L or L_(eff)), threshold voltage (V_(th)), gate width (W), supply voltage (V_(dd)), sub-threshold slope (n), mobility (μ), oxide capacitance (C_(ox)), clock period (D), thermal voltage (φ_(t)=kT/q), and drain induced barrier lower (DIBL) factor (σ). An example gate-level leakage energy, P_(leakage), can be represented in Equation 1 as:

$\begin{matrix} {P_{leakage} = {2 \cdot n \cdot \mu \cdot C_{ox} \cdot \frac{W}{L} \cdot \varphi_{t}^{2} \cdot D \cdot V_{dd} \cdot ^{\frac{{\sigma \cdot V_{dd}} - V_{th}}{n \cdot \varphi_{t}}}}} & (1) \end{matrix}$

A gate-level switching energy model can be represented as P_(switchmg) in Equation 2 below, where α is the switching probability.

P _(switching) =α·C _(ox) ·W·L·V _(dd) ²  (2)

Based on Equation (1) and Equation (2) above, leakage energy depends exponentially on the difference between supply and threshold voltage. Due to the impact of PV, the threshold voltage of each gate has a value apart from the nominal specification and, therefore, the value of the total leakage energy may exhibit a trend that is difficult to predict or control. However, the exponential dependence of the leakage energy on (σ·V_(dd)−V_(th)) provides an opportunity to reduce the leakage energy exponentially, assuming that threshold voltage can be increased in a controlled manner in the post-silicon phase. Based on this observation, an aging-based post-silicon tuning approach may significantly reduce the total leakage energy consumption of an IC.

Delay Model

The delay of a single logic gate can be represented in Equation 3 as:

d=gh+p  (3)

where g and h are logical effort and electrical effort, respectively; and p is parasitic delay. In particular, the delay model may be used to connect the gate delay to its sizing (e.g., effective width and length of the gate) and operating voltages. So, an example gate-level delay, Delay, can be represented in Equation 4 as:

$\begin{matrix} {{Delay} = {\frac{k_{tp} \cdot k_{fit} \cdot L^{2}}{2 \cdot n \cdot \mu \cdot \varphi_{t}^{2}} \cdot \frac{V_{dd}}{\left( {\ln\left( {^{\frac{{{({1 + \sigma})}V_{dd}} - V_{th}}{2 \cdot n \cdot \varphi_{t}}} + 1} \right)} \right)^{2}} \cdot \frac{{\gamma_{i} \cdot W_{i}} + W_{i + 1}}{W_{i}}}} & (4) \end{matrix}$

where subscripts i and i+1 represent the driver and load gates, respectively; y is the ratio of gate parasitic to input capacitance; and k_(tp) and k_(fit) are fitting parameters.

Based on analytical simulation of Equation (4), the delay of a logical gate increases approximately linearly as the increase of threshold voltage. Therefore, if the threshold voltage is increased to lower leakage energy consumption, the speed degradation may be much less than the savings that can be obtained in the leakage energy optimization. However, in order to maintain the timing constraint of the circuit, selective device aging and/or adaptive body bias (ABB) may be used to avoid increasing the delay of certain gates or compensating for the delay increase.

PV may cause major variations in gate-level physical properties such as L_(eff) and V_(th). For example, due to the impact of PV, the actual L_(eff) of a manufactured gate can be expressed by Equation (5), where L_(nom) is the nominal design value of the effective length, and ΔL is the variation in the manufacturing process.

L _(eff) =L _(nom) +ΔL  (5)

According to Equations (1) to (4), PV would have an indirect impact on the manifestational properties such as delay and power.

In some embodiments, ΔL may be assumed to follow a quad-tree model. In particular, ΔL may be distributed into multiple levels where there are different number of grids allocated on each level. The grids on each level may be assigned some variation values that follow a substantially normal distribution. Then the total ΔL, which can be calculated based on the sum of variation values on each level of the grids that the corresponding gate belongs to, can be represented in Equation (6), where ΔL_(ij) is the ith level of the grid that the gate belongs to, μ_(i) and σ_(i) are parameters of the Gaussian distribution at level i. Using this model for L_(eff), the spatial correlation of PV on an IC may be captured.

ΔL=ΣΔL _(ij), where ΔL _(ij) ˜N(μ_(i),σ_(i))  (6)

In addition, the distribution of V_(th) may be obtained by the simulation study of random dopant. V_(th) in this model may be fit into a Gaussian distribution in which the parameters are determined by the dopant number and dopant position.

Aging Model

The time dependence of V_(th) shift due to negative bias temperature instability (NBTI) generally may follow fractional power law of the stress time, as shown in Equation 7 below:

ΔV _(th) =A·exp(βV _(G))·exp(−E _(α) /kT)·t ^(0.25)  (7)

where V_(G) is the applied gate voltage; A and β are constants; E_(a) is the measured activation energy of a NBTI process; T is the temperature; and t is the stress time.

With the above discussed models, FIG. 1 shows a block diagram of an example process for performing aging-based leakage energy reduction for a post-silicon target circuit, in accordance with at least some embodiments of the present disclosure. The example process may include an aging input vector (IV) selection block 102, a post-silicon IC aging block 112, and a standby mode IV selection block 116. One embodiment of the aging IV selection block 102 may also include a simulation-based weights assignment block 104, a candidate IV selection block 106, and/or an aging IV selection block 108. The candidate IV selection block 106 may refer to an energy/delay model 114, and the aging IV selection block 108 may refer to an aging model 110. One example of the aging model 110 may correspond to the aforementioned Aging Model and Equation (7). One example of the energy/delay model 114 may correspond to the aforementioned Energy Model and Equations (1) and (2) and also the aforementioned Delay Model and Equations (3)-(6).

In the simulation-based weights assignment block 104, a simulation may be performed to the target circuit, so that one or more weights may be assigned to each gate in the target circuit indicative of the contribution of the gate to the overall energy consumption and critical timing constraints of the target circuit. The one or more weights depend on how often the gate stays on each level of leakage current in the operational mode. The weights may relate to one or both of timing and/or energy consumption.

In the candidate IV selection block 106, a set of candidate input vectors may be selected for aging gates in the target circuit. The goal may be to stress a first set of gates (e.g., the gates that are off a critical path (non-CP gates)) to reduce the energy consumption while keeping a second set of gates (e.g., the gates on a critical path (CP gates)) unstressed. By formulating this candidate input vector selection problem as a satisfiability (SAT) problem and by conducting an iterative SAT solving process, a set of desired input vectors are obtained. Due to the size of the target circuit, the SAT problem may not be satisfiable if all the gates are taken into consideration. Therefore, during the iterative SAT solving process, gates with less weight factors as determined in the simulation-based weights assignment block 104 may be removed from consideration to make the SAT problem solvable while still keeping a certain energy consumption level.

In the aging IV selection block 108, a set of aging input vectors from the candidate set determined in the candidate IV selection block 106 may be selected to stress the target circuit. The goal may be to maximize the stress of the non-CP gates and keep the delay of the circuit within a specific threshold. This operation may involve formulating a linear program (LP), in which the objective function is to maximize the total energy of the non-CP gates. For the timing constraints, since the CP gates keep changing during the aging process, they may be approximated using the longest path over gates. By solving the LP, the specific input vectors for aging may be obtained, as well as how much time to apply each of them.

In the post-silicon IC aging block 112, one or more selected input vectors can be applied to age the target circuit. The aging status may be monitored using physical level gate-level characterization.

After aging the target circuit, in the standby mode IV section block 116, additional one or more input vectors may be selected to be applied to the target circuit when the target circuit is in standby mode. In some embodiments, by adjusting and referring to the energy/delay model 114, one or more input vectors may be selected so that the CP gates of the target circuit are not constantly stressed while the target circuit stays on low leakage energy. Subsequent paragraphs will provide additional details for each of the aforementioned blocks in FIG. 1.

In some embodiments of the simulation-based weights assignment block 104, simulation may be conducted using the target circuit to obtain a leakage profile for all the gates. The leakage energy of a gate may be dependent on its input signals. For example, Table 1 below shows the measured leakage current for an example NAND gate on all the combinations of its input signals. Using similar lookup tables, if all the input signals for all the gates in the target circuit in the normal operation mode are tracked, then the leakage energy consumption for the gates can be identified.

TABLE 1 Leakage current of a NAND gate Input Leakage Current (nA) 00 37.84 01 100.3 10 95.17 11 454.5

Further, in the simulation, m input vectors may be applied to the target circuit and the signals of all n gates may be logged under each input vector i. Based on the lookup tables, the leakage current value P_(ij) may be obtained for each gate j under input vector i. The average leakage current of a gate may then be used as a first type of a weight factor, and this first type of weight factor may be represented by Equation (8) below:

$\begin{matrix} {{Weight}_{i} = {\frac{1}{m}{\sum\limits_{i = 1}{mP}_{ij}}}} & (8) \end{matrix}$

In short, this first type of weight factor can serve as an indicator how much leakage energy is consumed by each gate.

Similarly, a second type of weight factor may also be assigned to each gate based on the timing of the gate (e.g., delay experienced at the gate) in the normal operation mode. For instance, a higher weight may be assigned to gates that experience higher delay before aging and that belong to more constrained epsilon critical paths of the target circuit. Because such gates may have a high contribution to the eventual critical path of the target circuit, assigning a higher weight to such gates may help to ensure that these gates are not subject to additional slow-down due to device aging.

FIG. 2 shows an example method for identifying one or more input vectors for post-silicon IC aging, such as the candidate IV selection block 106 and the aging IV selection block 108 and of FIG. 1, in accordance with at least some embodiments of the present disclosure. Method 200 may include one or more operations, functions, or actions as illustrated by one or more of blocks 210-250. Although the blocks are illustrated in a sequential order, these blocks may also be performed in parallel, and/or in a different order than those described herein. Also, the various blocks may be combined into fewer blocks, divided into additional blocks, and/or eliminated based upon the desired implementation.

Processing for method 200 may being at block 200, “formulate SAT problem,” which may be followed by decision block 220, “SAT problem satisfiable?” If the SAT problem is satisfiable, then block 220 may be followed by block 240, “select one or more input vectors from a candidate set of input vectors.” Otherwise, block 220 may be followed by block 230, “remove gates from being considering in SAT problem.” Block 240 may be followed by block 250, “apply selected one or more input vectors to target circuit.”

In some embodiments, a Boolean SAT is formulated in block 210 to determine if a set of variables can be assigned to satisfy a Boolean formula. For example, suppose the netlist of the target circuit is known, and the signal of each gate can be expressed as a Boolean formula with a set of primary input signals as the variables. Therefore, the input vector selection problem that intends to set a specific gate or a set of gates to specific signals can be converted to a SAT problem. By solving the SAT problem, the desirable input vectors can be found based on gates signals requirements. Several SAT solvers may be used to obtain a solution, such as SAT4J.

In addition, in block 210, a set of objective criteria may be used to specify the signals of a subset of gates for which input vectors are being obtained. The gates that are not included in the objective criteria may not be considered in the SAT solving process. For example, the objective criteria in the SAT problem may follow the following format:

obj_(i)=0|1,i=1 . . . k  (9)

where obj_(i) corresponds to a gate identification (ID) in the circuit netlist, and k is the number of gates that are expected to specify signal 0 or 1. If the SAT problem is satisfiable, the output from solving the SAT problem may correspond to a set of candidate input vectors that satisfies the objective criteria.

FIG. 3 is an example SAT problem formulation, in accordance with at least some embodiments of the present disclosure. In the objective criteria, all the CP gates (gates 2, 3, and 6) are set to signal 0, and all the non-CP gates (gates 1, 4, and 5) are set to signal 1. Suppose the SAT problem is satisfiable, the input vector 00111 may be selected to satisfy the specified objective criteria.

As mentioned above, when the SAT problem is determined not to be satisfiable in block 220, in some embodiments, requirements specified in the SAT problem may be loosened. For instance, unimportant gates in terms of contribution to total leakage energy of the target circuit may be removed from being considered in the SAT problem in block 230. For CP gates, the importance of a gate may be determined by its delay property. According to the gate delay model, a gate may be considered relatively unimportant for candidate input vector selection if it is fast by itself and/or driven by few other gates. For non-CP gates, the leakage energy of a gate may be the major concern. A gate may be considered relatively unimportant if it consumes less leakage energy compared to other gates in the circuit.

For illustration, the method 200 may begin with the objective criteria of setting all the signals of CP gates to 0 and non-CP gates to 1 in formulating the SAT problem. If the resulting SAT problem is not satisfiable, the gate that has the lowest weight (as determined in the simulation-based weights assignment block 104 of FIG. 1) may be removed from being considered in the SAT objective criteria until a satisfiable SAT problem is obtained. One example process is shown in the table below:

Algorithm 1 Iterative Input Vector Selection Input: Netlist of the target circuit; PV Model; Output: Input vector set IV for aging  1: Calculate critical path gates set CP  2: for each obj_(i) in SAT S do  3: if obj_(i) ∈ CP then  4: obj_(i) = 0;  5: else  6: obj_(i) = 1;  7: end if  8: end for  9: IV = sat_solve(S); 10: while IV ==  do 11: Remove Obj_(i) with the lowest weight from Sat S; 12: IV = sat_solve(S); 13: end while 14: return IV;

The iterative process shown in FIG. 2 and the table above may generate a set of candidate input vectors that can be used in the IC aging process (e.g., post-silicon IC aging 112 from FIG. 1) to stress a certain set of gates (e.g., the non-CP gates) for leakage energy savings. Although the SAT objective criteria may specify setting the other set of gates (e.g., CP gates) in the unstressed mode (e.g., signal 0), due to the aging impact on the stressed non-CP gates and the unpredictable PV, the critical path may change over time and a subset of the initial non-CP gates may become CP gates as the target circuit ages. Therefore, they may impact the delay of the target circuit, and the speed of the target circuit may be substantially degraded because of the constant stress applied to the previously non-CP gates by applying the candidate input vectors.

To consider not only leakage energy savings but also the timing constraint of the target circuit, in block 240, a subset of input vectors may be selected from the entire set of the candidate input vectors to keep the timing constraint of the target circuit satisfied.

There are a number of timing constraints that can be naturally of importance when a specific design is synthesized. FIG. 4 shows examples of critical path and valid sensitization (sensitizable) critical path, in accordance with at least some embodiments of the present disclosure. In particular, there are 6 AND gates (A, B, C, D, E, and F) and one inverter. Primary inputs are denoted using small letters (a, b, c, d, e, and f). Primary outputs are also denoted using small letters (k, j, and l). Intermediate signals are denoted using letters g, h, i, j, m, n, and p. Suppose each gate has 10 picoseconds (ps) delay.

The critical path in the example design of FIG. 4 may go through gates A, D, and E, and the delay from input a or input b to output k may be 30 ps long. However, such a critical path may be considered a false path due to a possible race condition. In particular, AND gates A and E have as their inputs signals b and NOT b respectively. With the delay of the inverter, when the input signal b to A changes (e.g., changing to 1), and the input NOT b signal to E cannot simultaneously change (e.g., changing to 0). On the other hand, the path going through gates B and F is valid and can be referred to as a valid sensitization critical path. In this example, the delay from input c to output j is 20 ps long, and thus the delay for the valid sensitization critical path in this example design is 20 ps, instead of 30 ps, long.

Moreover, other example types of timing constraints include latency and throughput, which may be due to any number of constraints, such as race conditions. Latency may be defined as the time when the latest output is correctly computed measured from the moment when the latest input data is available. Throughput may be defined as the largest delay between the output of any sequential element to the input of any sequential element.

FIG. 5 shows example latency and throughput, in accordance with at least some embodiments of the present disclosure. Specifically, three sequential elements (e.g., registers) denoted R1, R2, and R3 shown in FIG. 5 are drawn twice to make the figure easier to follow. FIG. 5 also includes 8 arithmetic operations utilizing registers R1, R2, and R3 denoted by o1, o2, o3, o4, o5, o6, o7, and o8. Suppose each operation has a delay of 10 nanoseconds (ns). The latency in this example circuit may correspond to the time required for a signal from input I to reach output O, which may be 10 ns. In another example, the delay from R1 to R3 may be 30 ns.

In light of the present disclosure, it should be apparent to one having ordinary skills in the art to recognize that there are numerous other types of timing constraints, including, without limitation, synchronization, jitter, and precedence. For example, a particular type of event may need to be scheduled before some other type of event.

To achieve the goal of selecting a subset of input vectors from the candidate input vectors while keeping the timing constraint associated with the target circuit satisfied in block 240, one embodiment may be to set an additional set of timing constraints in a linear program, where the objective function may be to minimize the total leakage energy of a certain set of gates (e.g., the non-CP gates). For example, the maximum number of non-CP gates can be represented in Equation (10) below:

$\begin{matrix} {{maximize}\mspace{14mu} {\sum\limits_{i = 1}^{n}{\sum\limits_{j = 1}^{m}{\alpha_{j}p_{ij}}}}} & (10) \end{matrix}$

where n is the number of non-CP gates; m is the number of candidate input vectors obtained from the method 200; α_(j) (j=1 . . . m) is the percentage of time to apply each candidate input vector; and p_(ij) (i=1 . . . n; j=1 . . . m) is the expected leakage energy of non-CP gate i when input vector j is applied. The maximum number of non-CP gates may be placed in the stress mode: Among all the parameters, n can be obtained from the netlist of the target circuit; m may be provided by the aforementioned method 200; α_(j)'s are the variables being characterized in the LP; and p_(ij) can be obtained by the simulation process, except that the input vectors are fixed to each of the m candidate input vectors instead of being randomly selected.

When formulating the timing constraints in the LP, it should be noted that the critical path of the target circuit may be dependent on the selected input vectors, which also happens to be the output that are expected to be obtained from the LP. In some embodiments, to address this issue, the possible critical paths of the target circuit may be approximated using the initial longest paths in terms of delay through each gate, which can be obtained regardless of the change of the CP.

Based a targeted metric (e.g., timing constraints, leakage energy reduction requirements, etc.) associated with the target circuit, the candidate set of input vectors are identified, and one or more of input vectors are selected from the candidate set of input vectors. In block 250, the selected one or more input vectors, as well as the amount of time for their application, are applied to the target circuit.

To further illustrate the relationship between providing input vectors to a gate and the purposeful aging of the gate, FIG. 6 shows an example gate and the dependency between its inputs and outputs, in accordance with at least some embodiments of the present disclosure. A transistor ages when it acts as an open switch, because in that situation its channel is under stress. The NAND gate table in FIG. 6 shows the dependency between the inputs and the outputs, and the table on the right shows when and which transistor is considered open (e.g., under stress). “C” indicates a closed switch, and “O” indicates an open switch for a particular transistor. For example, if transistor T_PA is to be aged, then input a should be set to 1. If transistor T_PB is to be aged, then input b should be set to 1.

The aforementioned Equation (7) illustrates the connection between the time of stress and V_(th) (i.e., threshold voltage). Equation (4) shows the relationship between the delay and V_(th). Switching can result in energy dissipation that increases the temperature. Equation (7) indicates that at higher temperatures, aging may be exponentially faster.

FIG. 7 shows another example of how input vectors may be applied to create purposeful gate switching at a particular place and therefore increase the temperature, in accordance with at least some embodiments of the present disclosure. For example, if vectors (1,1,0) and (1,1,1) are applied as input signals i1, i2, and i3, then the output of gate s2 will change values, and the outputs of gates s1 and s3 will remain unchanged. If vectors (0,1,1) and (1,1,1) are applied as input signals i1, i2, and i3, then the output of gate s1 will change values, and the outputs of gates s2 and s3 will remain unchanged.

During the process of aging the gates of the target circuit, the threshold voltage of each gate may be monitored, especially for the CP gates, in order to increase the likelihood that the threshold voltage shift does not detrimentally impact the functionality of the gate. Since it is difficult to measure the threshold voltage at gate level directly, in some embodiments, a non-destructive gate-level characterization approach may be used that involves global power/delay measurements.

Specifically, manifestation-level characterization may be conducted to determine the power/delay of each gate on the target circuit by solving a system linear equations using linear programming. Physical level characterization may be conducted to calculate the V_(th) and L_(eff) of each gate, based on the manifestational properties and the models shown in the aforementioned Equations (1) to (4). This may be represented as a nonlinear programming process, since the models of power and delay may be represented as nonlinear with respect to V_(th) and L_(eff).

In some embodiments, at the manifestation level, a model can be expressed in a linear format assuming that the variation of all the physical level properties is represented by a single PV scaling factor K. The full-chip leakage power at input state j, ˜p_(j), can be represented in Equation (12) using the linear model at manifestation level below:

$\begin{matrix} {{\overset{\_}{p}}_{j} = {e_{ij} + e_{rj} + {\sum\limits_{{{\forall{{gate}\mspace{14mu} i}} = 1},\mspace{11mu} \ldots \mspace{14mu},n}{K_{ij}s_{i}}}}} & (12) \end{matrix}$

where s_(i) is the PV scaling factor of gate i; K_(ij) is the nominal leakage power for the gate at input state j, which is dependent on the constant parameters in (1) and input states (The value of K_(ij) can be found in a lookup table); and e_(sj) and e_(rj) are systematic and random measurement errors, respectively. A system of linear equations can be obtained by varying the primary input vectors and measuring the leakage power of the entire target circuit at each time. Then, by solving the system of equations with an objective function of minimizing the measurement errors, the gate-level PV scaling factors can be characterized and the leakage power for each gate can be obtained.

From the characterization results of the manifestational properties, a nonlinear equation based on Equation (1) representing gate-level leakage energy, P leakage, can be formulated in Equation (13) as:

$\begin{matrix} {P_{leakage} = {\frac{A}{L_{eff}} \cdot T^{2} \cdot ^{\frac{C - V_{th}}{BT}}}} & (13) \end{matrix}$

where L_(eff) and V_(th) are the two variables that are being characterizing. A, B and C may represent transistor level parameters in the leakage power model that may be assumed as constant values in the model.

Equation (13) provides a nonlinear equation that relates L_(eff) and V_(th) to the manifestational property (e.g., leakage power). The leakage power value can be obtained from the manifestation-level characterization. However, with one nonlinear equation, it may not be possible to solve the two variables L_(eff) and V_(th). Therefore, additional variations may be added to the leakage power model, so that a system of nonlinear equations can be obtained. In an embodiment, this goal may be achieved by varying the temperatures of the target circuit using thermal conditioning. Leakage power generally has an exponential relation with temperature T, and thermal conditioning can be used to control the temperatures and obtain multiple leakage power nonlinear equations for each single gate. By applying different temperature T to the target circuit and repeating the manifestation level characterization in terms of leakage power, a system of nonlinear equations can be formulated. The nonlinear equations can then be solved using a nonlinear program solver to obtain characterization results for V_(th) and L_(eff).

Besides using timing constraints in the aforementioned LP formulation, adaptive body bias (ABB) may be used to compensate the delay degradation associated with the target circuit. ABB may be an effective approach to compensate for the PV impact on performance and power consumption. It provides the ability to manipulate transistor threshold voltage through the body effect and thus enables either a forward or a reverse body effect to change threshold voltage. In particular, ABB may be utilized to manipulate the threshold voltages associated with the CP gates that are increased by aging, so that the degradation in critical path delay in the target circuit is compensated.

ABB can be used to change the V_(th) simultaneously for multiple transistors (e.g., all transistors in a circuit) in the same direction (e.g., increasing or decreasing threshold voltage). One can create multiple ABB circuitry. ABB may be applied to a circuit by adjusting an internal voltage regulator on-chip or by connecting a particular pin to a particular level of voltage before the chip is shipped to a customer.

ABB may be used to improve timing or leakage energy requirements. For example, if a timing or leakage energy requirement has been inadvertently violated through aging, such as the purposeful aging process as detailed above, ABB may be used to recover from the problem.

Based on the observations that (1) an IC may stay in a standby mode for most of the time during its operations, and (2) there may be a big difference between the highest level and lowest level leakage values when different input vectors are applied to the IC, various standby mode optimization approaches may be applied. However, the existing approaches typically consider the leakage savings and neglect the fact that the input vectors that lead to low level leakage values might age the circuit in an unexpected way.

The issue of standby mode leakage energy reduction can be addressed using SAT and LP based approaches as detailed above. FIG. 8 shows an example method 800 for identifying one or more input vectors for post-silicon IC aging in a standby mode, such as the standby mode IV selection block 116 of FIG. 1, in accordance with at least some embodiments of the present disclosure. Method 800 may include one or more operations, functions, or actions as illustrated by one or more of blocks 810-830. Although the blocks are illustrated in a sequential order, these blocks may also be performed in parallel, and/or in a different order than those described herein. Also, the various blocks may be combined into fewer blocks, divided into additional blocks, and/or eliminated based upon the desired implementation.

Processing for method 800 may being at block 810, “adjust objective function for linear programming,” which may be followed by block 820, “select one of more input vectors from candidate set of input vectors.” Block 820 may be followed by block 830, “apply selected one or more input vectors to target circuit.”

In some embodiments, the objective function specified in the aforementioned Equation (10) may be adjusted for the LP in block 810 to substantially minimize the leakage energy of all the CP and non-CP gates in the target circuit, while keeping the same delay constraints for the consideration of speed. After solving the LP and selecting one or more input vectors, in block 830, the selected one or more input vectors may be applied to the target circuit in the standby mode for leakage energy reduction and to avoid aging the critical paths to cause delay increase beyond the specified timing constraints.

Furthermore, the systems and methods described herein may be also used to improve yield for, and/or to correct for hot spots in the target circuit. For example, in some embodiments, to eliminate or reduce hot spots, the threshold voltages for the transistors in a certain portion of the target having been identified to exceed a threshold temperature may be reduced to reduce leakage energy in that part of the target circuit. In other embodiments, for systems requiring higher speed performance, yield may be improved by using the aforementioned ABB to reduce threshold voltages while increasing speed for the target circuit. The ABB may be calculated in such a way to ensure a specified speed of execution for a target circuit while the leakage energy associated with the target circuit is minimized. This specified speed can be found using binary search.

In some embodiments, the systems and methods described herein may be conducted during the manufacturing and testing phase of a target circuit or when the target circuit is in the field. For example, a computing device, coupled to the target circuit, may be configured to perform the above described gate level characterization and input vector generation and also load the appropriate input vectors in selected programmable circuits (e.g., flip-flops) to initiate the post-silicon aging of the target circuit. In situations where the target circuit is being used in a device in the field, the device may from time to time connect to a server, where the server may load the device with a new input vector. This new input vector may differ from the input vector that was applied to the target circuit during its manufacturing and testing phase. The device may then place the target circuit in standby mode and apply the new input vector to the target circuit.

FIG. 9 is a block diagram of an example computing device configured to purposefully age a post-silicon target circuit, arranged in accordance with at least some embodiments of the present disclosure. In a very basic configuration, computing device 900 typically includes one or more host processors 904 and a system memory 906. A memory bus 908 may be used for communicating between host processor 904 and system memory 906.

Depending on the desired configuration, host processor 904 may be of any type including but not limited to a microprocessor (μP), a microcontroller (μC), a digital signal processor (DSP), or any combination thereof. Processor 904 may include one more levels of caching, such as a level one cache 910 and a level two cache 912, a processor core 914, and registers 916. An example processor core 914 may include an arithmetic logic unit (ALU), a floating point unit (FPU), a digital signal processing core (DSP Core), or any combination thereof. An example memory controller 918 may also be used with processor 904, or in some implementations memory controller 918 may be an internal part of processor 904.

Depending on the desired configuration, system memory 906 may be of any type including but not limited to volatile memory (such as RAM), non-volatile memory (such as ROM, flash memory, etc.) or any combination thereof. System memory 906 may include an operating system 920, one or more applications 922, and program data 924. Application 922 may include an aging input vector selection algorithm 926 that can be arranged to perform the functions as described herein including those described with respect to at least the block 102 of FIG. 1, the method 200 of FIG. 2, and the method 800 of FIG. 8. Program data 924 may include parameters associated with aging/delay/energy models (e.g., the aging model 110 and the energy/delay model 114 of FIG. 1). In some embodiments, application 922 may be arranged to operate with program data 924 on operating system 920 such that implementations of input vector generation may be performed as described herein. This described basic configuration 902 is illustrated in FIG. 9 by those components within the inner dashed line.

Computing device 900 may have additional features or functionality, and additional interfaces to facilitate communications between basic configuration 902 and any required devices and interfaces. For example, a bus/interface controller 930 may be used to facilitate communications between basic configuration 902 and one or more data storage devices 932 via a storage interface bus 934. Data storage devices 932 may be removable storage devices 936, non-removable storage devices 938, or a combination thereof. Examples of removable storage and non-removable storage devices include magnetic disk devices such as flexible disk drives and hard-disk drives (HDD), optical disk drives such as compact disk (CD) drives or digital versatile disk (DVD) drives, solid state drives (SSD), and tape drives to name a few. Example computer storage media may include volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information, such as computer readable instructions, data structures, program modules, or other data.

System memory 906, removable storage devices 936 and non-removable storage devices 938 are examples of computer storage media. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which may be used to store the desired information and which may be accessed by computing device 900. Any such computer storage media may be part of computing device 900.

Computing device 900 may also include an interface bus 940 for facilitating communication from various interface devices (e.g., output devices 942, peripheral interfaces 944, and communication devices 946) to basic configuration 902 via bus/interface controller 930. Example output devices 942 include a graphics processing unit 948 and an audio processing unit 950, which may be configured to communicate to various external devices such as a display or speakers via one or more A/V ports 952. Example peripheral interfaces 944 include a serial interface controller or a parallel interface controller, which may be configured to communicate with external devices such as input devices (e.g., keyboard, mouse, pen, voice input device, touch input device, etc.) or other peripheral devices (e.g., printer, scanner, etc.) via one or more I/O ports 958. An example communication device 946 includes a network controller, which may be arranged to facilitate communications with one or more other computing devices 962 over a network communication link via one or more communication ports. In some implementations, computing device 900 includes a multi-core processor 964, which may communicate with the host processor 904 through the interface bus 940.

The network communication link may be one example of a communication media. Communication media may typically be embodied by computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and may include any information delivery media. A “modulated data signal” may be a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media may include wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, radio frequency (RF), microwave, infrared (IR) and other wireless media. The term computer readable media as used herein may include both storage media and communication media.

Computing device 900 may be implemented as a portion of a small-form factor portable (or mobile) electronic device such as a cell phone, a personal data assistant (PDA), a personal media player device, a wireless web-watch device, a personal headset device, an application specific device, or a hybrid device that include any of the above functions. Computing device 900 may also be implemented as a personal computer including both laptop computer and non-laptop computer configurations.

There is little distinction left between hardware and software implementations of aspects of systems; the use of hardware or software is generally (but not always, in that in certain contexts the choice between hardware and software can become significant) a design choice representing cost vs. efficiency tradeoffs. There are various vehicles by which processes and/or systems and/or other technologies described herein can be effected (e.g., hardware, software, and/or firmware), and that the preferred vehicle will vary with the context in which the processes and/or systems and/or other technologies are deployed. For example, if an implementer determines that speed and accuracy are paramount, the implementer may opt for a mainly hardware and/or firmware vehicle; if flexibility is paramount, the implementer may opt for a mainly software implementation; or, yet again alternatively, the implementer may opt for some combination of hardware, software, and/or firmware.

The foregoing detailed description has set forth various embodiments of the devices and/or processes via the use of block diagrams, flowcharts, and/or examples. Insofar as such block diagrams, flowcharts, and/or examples contain one or more functions and/or operations, it will be understood by those within the art that each function and/or operation within such block diagrams, flowcharts, or examples can be implemented, individually and/or collectively, by a wide range of hardware, software, firmware, or virtually any combination thereof. In some embodiments, several portions of the subject matter described herein may be implemented via Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs), digital signal processors (DSPs), or other integrated formats. However, those skilled in the art will recognize that some aspects of the embodiments disclosed herein, in whole or in part, can be equivalently implemented in integrated circuits, as one or more computer programs running on one or more computers (e.g., as one or more programs running on one or more computer systems), as one or more programs running on one or more processors (e.g., as one or more programs running on one or more microprocessors), as firmware, or as virtually any combination thereof, and that designing the circuitry and/or writing the code for the software and or firmware would be well within the skill of one of skill in the art in light of this disclosure. In addition, those skilled in the art will appreciate that the mechanisms of the subject matter described herein are capable of being distributed as a program product in a variety of forms, and that an illustrative embodiment of the subject matter described herein applies regardless of the particular type of signal bearing medium used to actually carry out the distribution. Examples of a signal bearing medium include, but are not limited to, the following: a recordable type medium such as a floppy disk, a hard disk drive, a Compact Disc (CD), a Digital Video Disk (DVD), a digital tape, a computer memory, etc.; and a transmission type medium such as a digital and/or an analog communication medium (e.g., a fiber optic cable, a waveguide, a wired communications link and/or channel, a wireless communication link and/or channel, etc.).

Those skilled in the art will recognize that it is common within the art to describe devices and/or processes in the fashion set forth herein, and thereafter use engineering practices to integrate such described devices and/or processes into data processing systems. That is, at least a portion of the devices and/or processes described herein can be integrated into a data processing system via a reasonable amount of experimentation. Those having skill in the art will recognize that a typical data processing system generally includes one or more of a system unit housing, a video display device, a memory such as volatile and non-volatile memory, processors such as microprocessors and digital signal processors, computational entities such as operating systems, drivers, graphical user interfaces, and applications programs, one or more interaction devices, such as a touch pad or screen, and/or control systems including feedback loops and control motors (e.g., feedback for sensing position and/or velocity; control motors for moving and/or adjusting components and/or quantities). A typical data processing system may be implemented utilizing any suitable commercially available components, such as those typically found in data computing/communication and/or network computing/communication systems.

The herein described subject matter sometimes illustrates different components contained within, or connected with, different other components. It is to be understood that such depicted architectures are merely examples and that in fact many other architectures can be implemented which achieve the same functionality. In a conceptual sense, any arrangement of components to achieve the same functionality is effectively “associated” such that the desired functionality is achieved. Hence, any two components herein combined to achieve a particular functionality can be seen as “associated with” each other such that the desired functionality is achieved, irrespective of architectures or intermedial components. Likewise, any two components so associated can also be viewed as being “operably connected”, or “operably coupled”, to each other to achieve the desired functionality, and any two components capable of being so associated can also be viewed as being “operably couplable”, to each other to achieve the desired functionality. Specific examples of operably couplable include but are not limited to physically mateable and/or physically interacting components and/or wirelessly interactable and/or wirelessly interacting components and/or logically interacting and/or logically interactable components.

With respect to the use of substantially any plural and/or singular terms herein, those having skill in the art can translate from the plural to the singular and/or from the singular to the plural as is appropriate to the context and/or application. The various singular/plural permutations may be expressly set forth herein for sake of clarity.

It will be understood by those within the art that, in general, terms used herein, and especially in the appended claims (e.g., bodies of the appended claims) are generally intended as “open” terms (e.g., the term “including” should be interpreted as “including but not limited to,” the term “having” should be interpreted as “having at least,” the term “includes” should be interpreted as “includes but is not limited to,” etc.). It will be further understood by those within the art that if a specific number of an introduced claim recitation is intended, such an intent will be explicitly recited in the claim, and in the absence of such recitation no such intent is present. For example, as an aid to understanding, the following appended claims may contain usage of the introductory phrases “at least one” and “one or more” to introduce claim recitations. However, the use of such phrases should not be construed to imply that the introduction of a claim recitation by the indefinite articles “a” or “an” limits any particular claim containing such introduced claim recitation to inventions containing only one such recitation, even when the same claim includes the introductory phrases “one or more” or “at least one” and indefinite articles such as “a” or “an” (e.g., “a” and/or “an” should typically be interpreted to mean “at least one” or “one or more”); the same holds true for the use of definite articles used to introduce claim recitations. In addition, even if a specific number of an introduced claim recitation is explicitly recited, those skilled in the art will recognize that such recitation should typically be interpreted to mean at least the recited number (e.g., the bare recitation of “two recitations,” without other modifiers, typically means at least two recitations, or two or more recitations). Furthermore, in those instances where a convention analogous to “at least one of A, B, and C, etc.” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., “a system having at least one of A, B, and C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc.). In those instances where a convention analogous to “at least one of A, B, or C, etc.” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., “a system having at least one of A, B, or C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc.). It will be further understood by those within the art that virtually any disjunctive word and/or phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to contemplate the possibilities of including one of the terms, either of the terms, or both terms. For example, the phrase “A or B” will be understood to include the possibilities of “A” or “B” or “A and B.”

While various aspects and embodiments have been disclosed herein, other aspects and embodiments will be apparent to those skilled in the art. The various aspects and embodiments disclosed herein are for purposes of illustration and are not intended to be limiting, with the true scope and spirit being indicated by the following claims. 

1. A method to reduce leakage energy associated with a post-silicon target circuit, the method comprising: selecting a plurality of gates in the target circuit to be aged; determining an extent to which to age the selected plurality of gates; identifying a first set of gates and a second set of gates of the selected plurality of gates that will be aged differently based on a targeted metric including a timing constraint associated with the target circuit; and purposefully aging, for the determined extent, the first set of gates and the second set of gates based on the targeted metric.
 2. The method of claim 1, further comprising characterizing the plurality of gates at a transistor or gate level.
 3. (canceled)
 4. (canceled)
 5. The method of claim 1, further comprising assigning a first weight and a second weight to each gate in the target circuit based on a contribution of the each gate to energy consumption and critical timing constraints of the target circuit, wherein the first weight is associated with leakage energy, and the second weight is associated with timing.
 6. The method of claim 5, further comprising: formulating a satisfiability (SAT) problem that includes a first set of objectives for the first set of gates and a second set of objectives for the second set of gates to reduce the leakage energy associated with the target circuit; and selecting a set of candidate input vectors for the target circuit by iteratively solving the SAT problem by removing one or more gates from being considered in the first set of objectives and the second set of objectives based on the first weight and the second weight.
 7. The method of claim 6, further comprising selecting a subset of input vectors from the set of candidate input vectors in such a way that the timing constraint associated with the target circuit is also satisfied.
 8. The method of claim 7, further comprising setting the timing constraint in a linear program that includes an objective of reducing leakage energy associated with the second set of gates.
 9. The method of claim 8, further comprising approximating a possible critical path in the target circuit based on an initial longest path in terms of delays associated with a subset of gates in the target circuit.
 10. The method of claim 1, further comprising applying adaptive body bias (ABB) to the target circuit based on the targeted metric.
 11. The method of claim 1, wherein the purposefully aging the plurality of gates in the target circuit reduces a hot spot in the target circuit.
 12. The method of claim 1, wherein the purposefully aging the plurality of gates in the target circuit improves yield.
 13. The method of claim 7, further comprising: providing the subset of input vectors to the target circuit to age at least some of the second set of gates more than the first set of gates.
 14. A non-transitory computer-readable medium that includes instructions to reduce leakage energy associated with a post-silicon target circuit, which in response to execution by a processor, cause the processor to: select a plurality of gates in the target circuit to be aged; determine an extent to which to age the selected plurality of gates; identify a first set of gates and a second set of gates of the selected plurality of gates that will be aged differently based on a targeted metric including a timing constraint associated with the target circuit; and purposefully age, for the determined extent, the first set of gates and the second set of gates based on the targeted metric.
 15. The non-transitory computer readable medium of claim 14, further including instructions, which in response to execution by the processor, cause the processor to characterize the plurality of gates at a transistor or gate level.
 16. (canceled)
 17. (canceled)
 18. The non-transitory computer readable medium of claim of claim 14, further including instructions, which in response to execution by the processor, cause the processor to: assign a first weight and a second weight to each gate in the target circuit based on a contribution of the each gate to energy consumption and critical timing constraints of the target circuit, wherein the first weight is associated with leakage energy, and the second weight is associated with timing.
 19. The non-transitory computer readable medium of claim of claim 18, further including instructions, which in response to execution by the processor, cause the processor to: formulate a satisfiability (SAT) problem that includes a first set of objectives for the first set of gates and a second set of objectives for the second set of gates to reduce the leakage energy associated with the target circuit; and select a set of candidate input vectors for the target circuit through an iterative solution of the SAT problem by removal of one or more gates from being considered in the first set of objectives and the second set of objectives based on the first weight and the second weight.
 20. The non-transitory computer readable medium of claim of claim 19, further including instructions, which in response to execution by the processor, cause the processor to select a subset of input vectors from the set of candidate input vectors in such a way that the timing constraint associated with the target circuit is also satisfied.
 21. The non-transitory computer readable medium of claim of claim 20, further including instructions, which in response to execution by the processor, cause the processor to set the timing constraint in a linear program that includes an objective to reduce leakage energy associated with the second set of gates.
 22. The non-transitory computer readable medium of claim of claim 21, further including instructions, which in response to execution by the processor, cause the processor to approximate a possible critical path in the target circuit based on an initial longest path in terms of delays associated with a subset of gates in the target circuit.
 23. The non-transitory computer readable medium of claim of claim 14, further including instructions, which when in response to execution by the processor, cause the processor to apply adaptive body bias (ABB) to the target circuit based on the targeted metric.
 24. The non-transitory computer readable medium of claim of claim 14, wherein the purposefully age of the plurality of gates in the target circuit reduces a hot spot in the target circuit.
 25. The non-transitory computer readable medium of claim of claim 14, wherein the purposefully age of the plurality of gates in the target circuit improves yield.
 26. The non-transitory computer readable medium of claim of claim 20, further including instructions, which in response to execution by the processor, cause the processor to: provide the subset of input vectors to the target circuit to age at least some of the second set of gates more than the first set of gates.
 27. A computing device coupled to a post-silicon target circuit and configured to reduce leakage energy associated with the post-silicon target circuit, comprising: a programmable unit; and a processor, coupled to the programmable unit, wherein the processor is configured to: select a plurality of gates in the target circuit to be aged; determine an extent to which to age the selected plurality of gates; identify a first set of gates and a second set of gates of the selected plurality of gates that will be aged differently based on a targeted metric including a timing constraint associated with the target circuit; and purposefully age, for the determined extent, the first set of gates and the second set of gates based on the targeted metric.
 28. The computing device of claim 27, wherein the processor is further configured to characterize the plurality of gates at a transistor or gate level.
 29. (canceled)
 30. (canceled)
 31. The computing device of claim 30, wherein the processor is further configured to: assign a first weight and a second weight to each gate in the target circuit based on a contribution of the each gate to energy consumption and critical timing constraints of the target circuit, wherein the first weight is associated with leakage energy, and the second weight is associated with timing.
 32. The computing device of claim 31, wherein the processor is further configured to: formulate a satisfiability (SAT) problem that includes a first set of objectives for the first set of gates and a second set of objectives for the second set of gates to reduce the leakage energy associated with the target circuit; and select a set of candidate input vectors for the target circuit through an iterative solution of the SAT problem by removal of one or more gates from being considered in the first set of objectives and the second set of objectives based on the first weight and the second weight.
 33. The computing device of claim 32, wherein the processor is configured to select a subset of input vectors from the set of candidate input vectors in such a way that the timing constraint associated with the target circuit is also satisfied.
 34. The computing device of claim 33, wherein the processor is further configured to set the timing constraint in a linear program that includes an objective to reduce leakage energy associated with the second set of gates.
 35. The computing device of claim 34, wherein the processor is further configured to approximate a possible critical path in the target circuit based on an initial longest path in terms of delays associated with a subset of gates in the target circuit.
 36. The computing device of claim 27, wherein the processor is further configured to apply adaptive body bias (ABB) to the target circuit based on the targeted metric.
 37. The computing device of claim 33, wherein the processor is further configured to load the subset of input vectors in the programmable unit, so that the subset of input vectors are applied to the target circuit to age at least some of the second set of gates more than the first set of gates. 